Pseudo Multi-hop Distributed Consensus Algorithm with Time Delay
نویسندگان
چکیده
منابع مشابه
Adaptive Consensus Control for a Class of Non-affine MIMO Strict-Feedback Multi-Agent Systems with Time Delay
In this paper, the design of a distributed adaptive controller for a class of unknown non-affine MIMO strict-feedback multi agent systems with time delay has been performed under a directed graph. The controller design is based on dynamic surface control method. In the design process, radial basis function neural networks (RBFNNs) were employed to approximate the unknown nonlinear functions. S...
متن کاملDistributed Kalman filtering with minimum-time consensus algorithm
Fueled by applications in sensor networks, these years have witnessed a surge of interest in distributed estimation and filtering. A new approach is hereby proposed for the Distributed Kalman Filter (DKF) by integrating a local covariance computation scheme. Compared to existing well-established DKF methods, the virtue of the present approach lies in accelerating the convergence of the state es...
متن کاملConsensus Seeking Using Multi-Hop Relay Protocol
We consider the problem of average consensus seeking in networked multi-agent systems. Based on local information and a simple distributed algorithm, states of all agents automatically converge to the average value of the initial conditions, where the convergence speed is determined by the algebraic connectivity of the underlying communication network. In order to achieve an average consensus q...
متن کاملDistributed throughput-optimal scheduling framework with delay analysis in multi-hop wireless networks
In wireless networks, due to the shared medium, we require sophisticated algorithms to schedule concurrent transmissions that meet the interference constraint where two nodes cannot transmit simultaneously in a guaranteed interference range of each other. For the general (K -hop) interference model,1 especially with K ≥ 2, the throughputoptimal centralized scheduler needs to solve a NP-Hard pro...
متن کاملDistributed Path Consensus Algorithm
Path planning methods based on discrete graph searches are highly effective in dealing with large-scale environments, arbitrarily shaped obstacles, frequent map updates and complex cost functions. When it comes to planning for teams of coupled agents however, typical graph searchbased planning techniques quickly become infeasible due to the exponential growth of the dimensionality of the joint ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: DEStech Transactions on Computer Science and Engineering
سال: 2017
ISSN: 2475-8841
DOI: 10.12783/dtcse/cece2017/14426